A Composition Construction of Bent-Like Boolean Functions from Quadratic Polynomials
نویسندگان
چکیده
Boolean functions used in cryptosystems are required to have good cryptographic properties, such as balancedness, high nonlinearity and high algebraic degree, to ensure the systems are resistant against linear cryptanalysis ([2]). Besides, it is a desirable property that a Boolean function has 3-valued spectra. This property provides a protection against the soft output joint attack ([3]). A framework unifies such cryptographic properties is to introduce the concept of near-bent function. Except balancedness, such a function behaves like a bent function, that is, it has 3-valued spectra and high nonlinearity close to the upper bound on nonlinearity, and may have high algebraic degree. It is important to study near-bent functions since bent functions are not balanced and can’t be directly used in a cryptosystem. There is an intrinsic relation between near-bent functions and bent functions. Bent functions can be constructed from near-bent functions ([4]), and vice versa. Another important aspect to study bent and near-bent functions is that the theory is closely related to combinatorics ([5-7]) and communication ([8-15]) in some useful fields such as difference set, partial spread, and sequences with low cross correlation.
منابع مشابه
Around bent and semi-bent quadratic Boolean functions
The maximum length sequences, also called m-sequences, have received a lot of attention since the late sixties. In terms of LFSR synthesis they are usually generated by certain power polynomials over finite field and in addition characterized by a low cross correlation and high nonlinearity. We say that such sequence is generated by a semi-bent function. Some new families of such function, repr...
متن کاملNew Construction for Balanced Boolean Functions with Very High Nonlinearity
In the past twenty years, there were only a few constructions for Boolean functions with nonlinearity exceeding the quadratic bound 2n−1 − 2(n−1)/2 when n is odd (we shall call them Boolean functions with very high nonlinearity). The first basic construction was by Patterson and Wiedemann in 1983, which produced unbalanced function with very high nonlinearity. But for cryptographic applications...
متن کاملNew Quadratic Bent Functions in Polynomial Forms with Coefficients in Extension Fields
In this paper, we first discuss the bentness of a large class of quadratic Boolean functions in polynomial form f(x) = ∑n 2 −1 i=1 Tr n 1 (cix 1+2i) + Tr n/2 1 (cn/2x 1+2n/2), where ci ∈ GF (2) for 1 ≤ i ≤ n 2 − 1 and cn/2 ∈ GF (2). The bentness of these functions can be connected with linearized permutation polynomials. Hence, methods for constructing quadratic bent functions are given. Furthe...
متن کاملEffective Construction of a Class of Bent Quadratic Boolean Functions
In this paper, we consider the characterization of the bentness of quadratic Boolean functions of the form f(x) = ∑ m 2 −1 i=1 Tr n 1 (cix 1+2ei)+Tr n/2 1 (cm/2x 1+2n/2), where n = me, m is even and ci ∈ GF (2 ). For a general m, it is difficult to determine the bentness of these functions. We present the bentness of quadratic Boolean function for two cases: m = 2p and m = 2pq, where p and q ar...
متن کاملOn testing bent functions
A bent function is a Boolean function all of whose Fourier coefficients are equal in absolute value. These functions have been extensively studied in cryptography and play an important role in cryptanalysis and design of cryptographic systems. We study bent functions in the framework of property testing. In particular, we show that testing whether a given Boolean function on n variables is bent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2003 شماره
صفحات -
تاریخ انتشار 2003